On the Hurwitz Product of Formal Power Series and Automata
نویسنده
چکیده
Kiister, G., On the Hurwitz product of formal power series and automata, Theoretical Computer Science 83 (1991) 261-273. The Hurwitz (shuffle) product defined on formal power series is generalized to matrices and therefore to automata. The resulting constructions are then used to study commutative power series and abstract families of power series. In particular, the families of power series resulting from applying the generalized wedge operator to semi-AFPs and AFPs are characterized.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملParikh's Theorem Does Not Hold for Multiplicities
We consider the question of whether the famous Parikh's theorem holds with multiplicities i.e., for formal power series instead of languages. We introduce two families of semilinear formal power series over a commutative product monoid. The strict hierarchy of algebraic, rational, recognizable and semi-linear formal power series is proved and in this way it is established that the Parikh's theo...
متن کاملOn exponentials of exponential generating series
1: After identification of the algebra of exponential generating series with the shuffle algebra of ordinary formal power series, the exponential map exp! : XK[[X]] −→ 1 +XK[[X]] for the associated Lie group with multiplication given by the shuffle product is well-defined over an arbitrary field K by a result going back to Hurwitz. The main result of this paper states that exp! (and its recipro...
متن کاملOn transformations of formal power series
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve recognizability, ge...
متن کاملCoalgebraic Semantics of Heavy-Weighted Automata
In this paper we study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be formal power series. As for ordinary weighted automata, the behaviour of heavy-weighted automata is expressed in terms of formal power series. We propose several equivalent definitions for their semantics, including a system of behavioural differential equations (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 83 شماره
صفحات -
تاریخ انتشار 1991